Ant Colony Optimisation for Job Shop Scheduling
نویسندگان
چکیده
A recent adaptive algorithm, named Ant System, is introduced and used to solve the problem of job shop scheduling. The algorithm was first introduced by Dorigo, Maniezzo and Colorni in 1991 and is derived from the foraging and recruiting behaviour observed in an ant colony. It can be applied to combinatorial optimisation problems. This paper outlines the algorithm’s implementation and performance when applied to job shop scheduling. The algorithm parameter settings seem to play a crucial role in its efficiency and determine the quality of solutions. In this paper we present some statistic analysis for parameter tuning and we compare the quality of obtained solutions for well-known benchmark problems in job shop scheduling.
منابع مشابه
Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method
This paper proposes an ant colony optimisation-based software system for solving FMS scheduling in a job-shop environment with routing flexibility, sequence-dependent setup and transportation time. In particular, the optimisation problem for a real environment, including parallel machines and operation lag times, has been approached by means of an effective pheromone trail coding and tailored a...
متن کاملAnt Colony Optimisation for multi-level assembly job shop scheduling
Job shop scheduling is one of the most explored areas in the last few decades. Although it is very commonly witnessed in real-life situations, very less investigation has been carried out in scheduling operations of multi-level jobs, which undergo serial, parallel, and assembly operations in an assembly job shop. In this work, some of the dispatch rules, which have best performances in scheduli...
متن کاملA hybrid ant colony optimisation algorithm for job shop problems and its convergence analysis
This paper presents a hybrid ant colony optimisation (HACO) algorithm for solving job shop problems. The criterion considered is the maximum completion time, the so-called makespan. The HACO algorithm improves the performance of intelligence optimisation algorithm, which adopts ant colony optimisation (ACO) algorithm to search in the global solution space, and tabu search (TS) algorithm is util...
متن کاملSolution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation
Ant colony optimisation, a constructive metaheuristic inspired by the foraging behaviour of ants, has been applied to a wide range of problems since its inception. Many of these are production scheduling problems such as the job shop, in which a collection of operations (grouped into jobs) must be scheduled for processing on different machines. In typical ACO applications, solutions are generat...
متن کاملApplying Ant Colony Optimisation (ACO) algorithm to dynamic job shop scheduling problems
Ant Colony Optimization (ACO) is applied to two dynamic job scheduling problems, which have the same mean total workload but different dynamic levels and disturbing severity. Its performances are statistically analysed and the effects of its adaptation mechanism and parameters such as the minimal number of iterations and the size of searching ants are studied. The results show that ACO can perf...
متن کامل